Gaussian Processes Incremental Inference for Mobile Robots Dynamic Planning
نویسندگان
چکیده
منابع مشابه
Local Incremental Planning for Nonholonomic Mobile Robots
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, approximating a previously built holonomic path, or computationally intensive, being based on configuration space discretization. Our nonholonomic planner employs a direct projection strategy to modify on-line the outp...
متن کاملDynamic mission planning for multiple mobile robots
Planning for multiple mobile robots in dynamic environments involves determining the optimal path each robot should follow to accomplish the goals of the mission, given the current knowledge available about the world. As knowledge increases or improves, the planning system should dynamically reassign robots to goals in order to continually minimize the time to complete the mission. In this pape...
متن کاملMotion Planning in Non-Gaussian Belief Spaces for Mobile Robots
In this paper we propose a method for motion planning under uncertainty that can deal with situations where ambiguous data associations result in a multimodal hypothesis in belief space. Unlike conventional methods, planning based on the most-likely hypothesis is no longer possible in such cases. We adopt a Gaussian Mixture Model (GMM) for belief representation and use a Receding Horizon Planni...
متن کاملpolynomial optimal trajectory planning and obstacle aviodance for omni-directional mobile robots in dynamic environments
this paper presents a parameterization method to optimal trajectory planning and dynamic obstacle avoidance for omni-directional robots. the aim of trajectory planning is minimizing a quadratic cost function while a maximum limitation on velocity and acceleration of robot is considered. first, we parameterize the trajectory using polynomial functions with unknown coefficients which transforms t...
متن کاملIncremental Gaussian Processes
In this paper, we consider Tipping’s relevance vector machine (RVM) [1] and formalize an incremental training strategy as a variant of the expectation-maximization (EM) algorithm that we call Subspace EM (SSEM). Working with a subset of active basis functions, the sparsity of the RVM solution will ensure that the number of basis functions and thereby the computational complexity is kept low. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.2447